Disaggregate path flow estimation in an iterated DTA microsimulation

نویسندگان

  • Gunnar Flötteröd
  • Ronghui Liu
چکیده

This text describes the first application of a novel path flow and origin/destination (OD) matrix estimator for iterated dynamic traffic assignment (DTA) microsimulations. The presented approach, which operates on a trip-based demand representation, is derived from an agent-based DTA calibration methodology that relies on an activity-based demand model. The objective of this work is to demonstrate the transferability of the agent-based approach to the more widely used OD matrixbased demand representation. The calibration (i) operates at the same disaggregate level as the microsimulation and (ii) has drastic computational advantages over usual OD matrix estimators in that the demand adjustments are conducted within the iterative loop of the DTA microsimulation, which results in a running time of the calibration that is in the same order of magnitude as a plain simulation. We describe an application of this methodology to the trip-based DRACULA microsimulation and present an illustrative example that clarifies its capabilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

متن کامل

An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

متن کامل

Calibration of the Demand Simulator in a Dynamic Traffic Assignment System

In this thesis, we present a methodology to jointly calibrate the O-D estimation and prediction and driver route choice models within a Dynamic Traffic Assignment (DTA) system using several days of traffic sensor data. The methodology for the calibration of the O-D estimation module is based on an existing framework adapted to suit the sensor data usually collected from traffic networks. The pa...

متن کامل

DTA2012 Symposium: Combining Disaggregate Route Choice Estimation with Aggregate Calibration of a Dynamic Traffic Assignment Model

Dynamic Traffic Assignment (DTA) models are important decision support tools for transportation planning and real-time traffic management. One of the biggest obstacles of applying DTA in large-scale networks is the calibration of model parameters, which is essential for the realistic replication of the traffic condition. This paper proposes a methodology for the simultaneous demand-supply DTA c...

متن کامل

On DTA Curves for the Melting and Freezing of Alloys

Using a heat flow model of a DTA (differential thermal analyzer) and thermal characteristics obtained by fitting experimental results for a pure metal, the response of the DTA is modeled for the melting and solidification of alloys. The enthalpy-temperature relation used for the alloy simulations is obtained by two different methods: 1) equilibrium and Scheil considerations derived solely from ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010